By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Volume 21, Issue 1, pp. 1-201

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Efficient Motion Planning for an $L$-Shaped Object

Dan Halperin, Mark H. Overmars, and Micha Sharir

pp. 1-23

On the Average Size of the Intersection of Binary Trees

R. Baeza-Yates, R. Casas, J. Díaz, and C. Martínez

pp. 24-32

Polynomial Threshold Functions, $AC^0 $ Functions, and Spectral Norms

Jehoshua Bruck and Roman Smolensky

pp. 33-42

The Average Complexity of Parallel Comparison Merging

Mihály Geréb-Graus and Danny Krizanc

pp. 43-47

A Note on the Height of Suffix Trees

Luc Devroye, Wojciech Szpankowski, and Bonita Rais

pp. 48-53

Computing Algebraic Formulas Using a Constant Number of Registers

Michael Ben-Or and Richard Cleve

pp. 54-58

Asymptotic Analysis of an Algorithm for Balanced Parallel Processor Scheduling

Li-Hui Tsai

pp. 59-64

Conditions for Unique Graph Realizations

Bruce Hendrickson

pp. 65-84

Simplification of Nested Radicals

Susan Landau

pp. 85-110

Gossiping in Minimal Time

David W. Krumme, George Cybenko, and K. N. Venkataraman

pp. 111-139

Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems

Andrew V. Goldberg, Serge A. Plotkin, David B. Shmoys, and Eva Tardos

pp. 140-150

Efficient Embeddings of Trees in Hypercubes

Sandeep N. Bhatt, Fan R. K. Chung, F. Thomson Leighton, and Arnold L. Rosenberg

pp. 151-162

On the Exact Location of Steiner Points in General Dimension

Timothy Law Snyder

pp. 163-180

On Learning Ring-Sum-Expansions

Paul Fischer and Hans-Ulrich Simon

pp. 181-192

Locality in Distributed Graph Algorithms

Nathan Linial

pp. 193-201